منابع مشابه
The spectra of Knödel graphs
Knödel graphs Wd,n are regular graphs on n vertices and degree d. They have been introduced by W. Knödel and have been proved to be minimum gossip graphs and minimum broadcast graphs for d = blog nc. They became even more interesting in the light of recent results regarding the diameter, which is, up to now, the smallest known diameter among all minimum broadcast graphs on 2 vertices. Also, the...
متن کاملEdge Disjoint Hamilton Cycles in Knödel Graphs
All graphs considered here are simple and finite unless otherwise stated. LetCk (resp.Pk) denote the cycle (resp. path) on k vertices. For a graphG, if its edge set E(G) can be partitioned into E1,E2, . . . ,Ek such that 〈Ei〉 ∼= H, for all i, 1 ≤ i ≤ k, then we say thatH decomposesG.A k-factor ofG is a k-regular spanning subgraph of it. A k-factorization of a graphG is a partition of the edge s...
متن کاملRecognizing HHDS-Free Graphs
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In particular, we describe a simple O(nm)-time algorithm which determines whether a graph G on n vertices and m edges is HHDS-free. To the best of our knowledge, this is the first polynomial-time algorithm for recognizing this...
متن کاملRecognizing Berge Graphs
A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. In this paper we give an algorithm to test if a graph G is Berge, with running time O(|V (G)|). This is independent of the recent proof of the strong perfect graph conjecture.
متن کاملRecognizing k-path Graphs
The k-path graph Pk(H) of a graph H has all length-k paths of H as vertices; two such vertices are adjacent in the new graph if their union forms a path or cycle of length k + 1 in H , and if the common edges of both paths form a path of length k − 1. In this paper we give a (nonpolynomial) recognition algorithm for k-path graphs, for every integer k¿2. The algorithm runs in polynomial time if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00270-9